package LeetCode.interview;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;

import LeetCode.interview._104_Maximum_Depth_of_Binary_Tree.TreeNode;

import sun.tools.jar.resources.jar;
import util.LogUtils;

/*
 * 
原题　
	The count-and-say sequence is the sequence of integers with the first five terms as following:
	
	1.     1
	2.     11
	3.     21
	4.     1211
	5.     111221
	
	1 is read off as "one 1" or 11.
	11 is read off as "two 1s" or 21.
	21 is read off as "one 2, then one 1" or 1211.
	
	Given an integer n, generate the nth term of the count-and-say sequence. 
题目大意
		　　计数和序列是前五个整数的整数序列，如下所示：
	
	    1
	    11
	    21
	    1211
	    111221
	
	1被读取为“一1”或11。
	11被读取为“两个1”或21。
	21被读取为“一个2，然后一个1”或1211。
	
	给定一个整数n，生成count-and-say序列的第n个项。
解题思路
	
 * @Date 2017-09-14 23：43
 */
public class _038_Count_and_Say {
    public String countAndSay(int n) {
        return null;
    }
	public static void main(String[] args) {
		_038_Count_and_Say obj = new _038_Count_and_Say();

	}

}
